Improvement on Huang et al.'s Novel Efficient Threshold Proxy Signature Scheme

نویسندگان

  • Jiang-hong Hu
  • Mei-juan Huang
  • Jian-zhong Zhang
  • Chin-Chen Chang
چکیده

In 2006, Hui-Feng Huang and Chin-Chen Chang proposed a novel efficient threshold proxy signature scheme based on Schnorr's scheme. In their scheme, the original signer could know who generated the threshold proxy signature and the receiver could certify the actuality of the proxy group signers who made the proxy signature. However, their scheme had some security weaknesses. In this paper, by identifying some concrete instances and analyzes, we demonstrate that their scheme is vulnerable to the forgery attack and the public-key substitute attack. That is, Huang et al.'s scheme could not achieve their claimed security requirement. Finally, we propose our improvement to eliminate the weaknesses and give its security analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Non-repudiable Threshold Proxy Signature Scheme with Known Signers

In 2004, Yang et al. proposed an efficient (t, n) threshold proxy signature scheme with known signers. However, Maimani et al. showed that a malicious original signer can forge a valid proxy signature for any message in Yang et al.’s scheme and further proposed an improvement to remedy such an attack. In this paper, we will show that in Maimani et al.s improvement, a malicious original or proxy...

متن کامل

Cryptanalysis of A Self-Certified Threshold Proxy Signature Scheme Ased on Elliptic Curve Discrete Logarithm Problem

Digital signatures based on self-certified public key systems are more efficient because the authentication of the users’ public keys can be implicitly accomplished with the signature verification. In 2009, Xue et al. proposed first self-certified threshold proxy signature scheme based on the elliptic curve discrete logarithm problem (ECDLP). In this paper, we show that Xue et al.’s scheme can ...

متن کامل

Cryptanalysis of Two Nonrepudiable Threshold Proxy Signature Schemes

This paper will show that Hsu and Wu’s efficient nonrepudiable threshold proxy signature scheme with known signers and Yang, Tzeng and Hwang’s efficient nonrepudiable threshold proxy signature scheme with known signers are insecure. The malicious original signer can forge a valid threshold proxy signature for any message and any warrant after getting a valid proxy signature. In addition, since ...

متن کامل

Cryptanalysis and Improvement on a Threshold Proxy Signature Scheme

In a (t, n) threshold proxy signature scheme, an original signer can delegate the signature authority to a proxy group of n member such that t or more than t proxy signers can cooperatively sign messages on behalf of the original signer, but t − 1 or fewer proxy signers cannot generate a valid proxy signature. In this paper, we review the security of C. L. Hsu et al.’s threshold proxy signature...

متن کامل

A novel efficient (t, n) threshold proxy signature scheme

All previously proposed threshold proxy signature schemes have been based on discrete logarithms required for a protocol to generate and verify a shared secret among the proxy group. Therefore, it is necessary for the proxy signers to perform many expensive modular exponential computations and communications to obtain and verify a shared secret. Moreover, most of the existing threshold proxy si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009